Multi-Objective Multicast Routing based on Ant Colony Optimization
نویسندگان
چکیده
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes cost of the multicast tree, average delay and maximum end-to-end delay. In this way, a set of optimal solutions, know as Pareto set, is calculated in only one run of the algorithm, without a priori restrictions. The proposed algorithm was inspired in a Multi-objective Ant Colony System (MOACS). Experimental results prove the proposed algorithm outperforms a recently published Multiobjective Multicast Algorithm (MMA), specially designed for solving the multicast routing problem.
منابع مشابه
Multicast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملRouting Optimization Based on Artificial Fish Swarm Algorithm
For multi-objective optimization in the QoS routing, this paper combines the artificial fish swarm algorithm and ant colony algorithm and tabu search algorithm, proposes a new improved algorithm, and delves into the application of solving the QoS routing. One main work in this paper is to put forward a mixed algorithm integrating artificial fish swarm and ant colony. Firstly, we randomly genera...
متن کاملHybrid Optimization for Multiobjective Multicast Routing
The multicast routing protocol in Wireless Sensor Networks (WSN) must be energy aware since the nodes are energy constrained due to limited battery life. This gives rise to the need for efficient multicast routing protocol that is able to determine multicast routes which satisfies the quality of service guarantees and at the same time conserves energy. The transmission of real time multimedia s...
متن کاملApplication of Modified Ant Colony Optimization (MACO) for Multicast Routing Problem
It is well known that multicast routing is combinatorial problem finds the optimal path between source destination pairs. Traditional approaches solve this problem by establishment of the spanning tree for the network which is mapped as an undirected weighted graph. This paper proposes a Modified Ant Colony Optimization (MACO) algorithm which is based on Ant Colony System (ACS) with some modifi...
متن کاملMultiobjective Multicast Routing with Ant Colony Optimization
This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum end-to-end delay. In this way, a set of optimal so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005